A note on Spector's quantifier-free rule of extensionality
نویسنده
چکیده
In this note we show that the so-called weakly extensional arithmetic in all finite types, which is based on a quantifier-free rule of extensionality due to C. Spector and which is of significance in the context of Gödel’s functional interpretation, does not satisfy the deduction theorem for additional axioms. This holds already for Π1axioms. Previously, only the failure of the stronger deduction theorem for deductions from (possibly open) assumptions (with parameters kept fixed) was known. ∗Basic Research in Computer Science, Centre of the Danish National Research Foundation.
منابع مشابه
On the Uniform Weak König’s Lemma
The so-called weak König’s lemma WKL asserts the existence of an infinite path b in any infinite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π2conservative over primitive recursive arithmetic PRA (and even weaker fragments of arit...
متن کاملOn uniform weak König's lemma
The so-called weak König’s lemma WKL asserts the existence of an infinite path b in any infinite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π2-conservative over primitive recursive arithmetic PRA (and even weaker fragments of ari...
متن کاملQuantifier-Free Interpolation of a Theory of Arrays
The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifierfree interpolants in general. In this paper, we show that it is possible to obtain quantifier-free interpolants for a Skolemized vers...
متن کاملOn a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal
The rewriting approach to T -satisfiability is based on establishing termination of a rewrite-based inference system for first-order logic on the T -satisfiability problem. Extending previous such results, including the quantifier-free theory of equality and the theory of arrays with or without extensionality, we prove termination for the theories of records with or without extensionality, inte...
متن کاملTheory decision by decomposition
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formula in such a way that its definitional part, including the theory, can be compiled by a rewrite-based firstorder theorem prover, and the residual problem can be decided by an SMT-solver, based on the Davis-Putnam-Logemann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 40 شماره
صفحات -
تاریخ انتشار 2001